Generalized AG codes and generalized duality
نویسندگان
چکیده
منابع مشابه
Explicit Construction of AG Codes from Generalized Hermitian Curves
We present multi-point algebraic geometric codes overstepping the Gilbert-Varshamov bound. The construction is based on the generalized Hermitian curve introduced by A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth. These codes are described in detail by constrcting a generator matrix. It turns out that these codes have nice properties similar to those of Hermitian codes. It is shown that the...
متن کاملGeneralized Serre duality
We introduce the generalized Serre functor S on a skeletally-small Hom-finite Krull-Schmidt triangulated category C. We prove that its domain Cr and range Cl are thick triangulated subcategories. Moreover, the subcategory Cr (resp. Cl) is the smallest additive subcategory containing all the objects in C which appears as the third term (resp. the first term) of some Aulsander-Reiten triangle in ...
متن کاملOn Brylawski's Generalized Duality
We introduce a notion of duality—due to Brylawski—that generalizes matroid duality to arbitrary rank functions. This allows us to define a generalization of the matroid Tutte polynomial. This polynomial satisfies a deletion-contraction recursion, where deletion and contraction are defined in this more general setting. We explore this notion of duality for greedoids, antimatroids and demi-matroi...
متن کاملGeneralized Benson-carlson Duality
1.1. Background. This paper deals with the landmark results of Benson and Carlson's Projective resolutions and Poincar e duality complexes [6]. Our goal is to provide some necessary background for that work, and to prove some of the results of [6] in a more general setting. In particular, we analyze what happens when we replace Benson and Carlson's complex C (in the notation of [6]) with an arb...
متن کاملGeneralized roof duality
The roof dual bound for quadratic unconstrained binary optimization is the basis for several methods for efficiently computing the solution to many hard combinatorial problems. It works by constructing the tightest possible lower-bounding submodular function, and instead of minimizing the original objective function, the relaxation is minimized. However, for higher-order problems the technique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2003
ISSN: 1071-5797
DOI: 10.1016/s1071-5797(02)00027-8